num = list(input())
for i in range(len(num) - 1, -1, -1):
if i == 0 and num[i] == str(9):
continue
if int(num[i]) > 9 - int(num[i]):
num[i] = str(9 - int(num[i]))
num = "".join(num)
print(num)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000010;
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size();i++)
{
if(i==0)
{
if((s[0]-'0')>=5&&(s[0]-'0')<9)
{
cout<<9-(s[0]-'0');
}
else
{
cout<<s[0];
}
}
else
{
if((s[i]-'0')>=5&&(s[i]-'0')<=9)
{
cout<<9-(s[i]-'0');
}
else
{
cout<<s[i];
}
}
}
return 0;
}1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |